An Ant Colony Optimization Application to the Single Machine Total Weighted Tardiness Problem
نویسندگان
چکیده
In this extended abstract we present an algorithm based on the Ant Colony Optimization (ACO) metaheuristic for the single machine total weighted tardiness problem, a well known NP–hard scheduling problem. Our ACO algorithm is currently among the best algorithms known for this problem type. In particular, we will discuss three elements that enable it to find very good solutions quickly. These are a powerful local search algorithm, the use of candidate lists that guide the ants’ solution construction, and a heterogeneous ant colony where ants apply various local search variants concurrently.
منابع مشابه
Ant Colony Optimization for the Total Weighted Tardiness Problem
In this article we present an application of the Ant Colony Optimization (ACO) metaheuristic to the single machine total weighted tardiness problem. First, we briefly discuss the constructive phase of ACO in which a colony of artificial ants generates a set of feasible solutions. Then, we introduce some simple but very effective local search. Last, we combine the constructive phase with local s...
متن کاملA New Ant Colony Optimization Approach for the Single Machine Total Weighted Tardiness Scheduling Problem
In this paper the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup times is faced with a new Ant Colony Optimization (ACO) approach. The proposed ACO algorithm is based on a new global pheromone update mechanism, which makes the pheromone trails asymptotically range between two bounds arbitrarily fixed and the ACO learning mechanism ind...
متن کاملAn Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness Problem. Compared to an existing ACO algorithm for the unweighted Total Tar-diness Problem our algorithm has several improvements. The main novelty is that in our algorithm the ants are guided on their way to good so...
متن کاملApplying Ant Colony Optimization to Solve the Single Machine Total Tardiness Problem
Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem. The paper introduces an Ant Colony Optimization approach to solve the problem of determining a job-sequence that minimizes the overall tardine...
متن کاملMinimizing Total Tardiness on a Single Machine Using Ant Colony Optimization
Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem. The paper introduces an Ant Colony Optimization approach to solve the problem of determining a job-sequence that minimizes the overall tardine...
متن کامل